Reactive GRASP with Path Relinking for Selecting OLAP Views
نویسندگان
چکیده
The materialization of views promotes the reduction of multidimensional queries’s execution time. However, this materialization has an associated cost that may exceed the cost constraints of a given environment, characterizing the view selection problem (VSP). VSP consists in selecting the best views given a certain cost threshold. Several solutions have been proposed in the literature to try and solve this problem. In this paper, the VSP is handled by using novel optimization algorithms based on the reactive GRASP meta-heuristic and variants of the path relinking heuristic. The experimental results show that the proposed algorithm is able to provide better solutions regarding the queries runtime, compared to other heuristics in the literature. Our reactive algorithm promoted a reduction of 10.25% in the queries runtime.
منابع مشابه
A GRASP and Path Relinking Heuristic for Rural Road Network Development
This paper presents a model for rural road network design that involves two objectives: maximize all season road connectivity among villages in a region and maximize route efficiency, while allocating a fix budget among a number of possible road projects. The problem is modeled as a bicriterion optimization problem and solved heuristically through a greedy randomized adaptive search procedure (...
متن کاملGRASP and path relinking for the max-min diversity problem
The Max-Min Diversity Problem (MMDP) consists in selecting a subset of elements from a given set in such a way that the diversity among the selected elements is maximized. The problem is NP-hard and can be formulated as an integer linear program. Since the 1980s, several solution methods for this problem have been developed and applied to a variety of fields, particularly in the social and biol...
متن کاملGrasp with Path-relinking: Recent Advances and Applications
Path-relinking is a major enhancement to the basic greedy randomized adaptive search procedure (GRASP), leading to significant improvements in solution time and quality. Path-relinking adds a memory mechanism to GRASP by providing an intensification strategy that explores trajectories connecting GRASP solutions and the best elite solutions previously produced during the search. This paper revie...
متن کاملGrasp with Evolutionary Path-relinking
We propose GRASP with evolutionary path-relinking, a metaheuristic resulting from the hybridization of GRASP, path-relinking, and evolutionary path-relinking. This metaheuristic is applied to a network migration problem. Experiments show that a GRASP with evolutionary path-relinking heuristic finds solutions faster than a heuristic based on GRASP with path-relinking as well as one based on pure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016